Undecidability and incompleteness in classical mechanics
نویسندگان
چکیده
منابع مشابه
Undecidability and Incompleteness in Classical Mechanics
We describe Richardson's functor from the Diophantine equations and Diophantine problems into elementary real-valued functions and problems. We then derive a general undecidability and incompleteness result for elementary functions within ZFC set theory, and apply it to some problems in Hamiltonian mechanics and dynamical systems theory. Our examples deal with the algorithmic impossibility of d...
متن کاملIncompleteness and Undecidability
Every theory we will consider will be in a language that has a name ṅ for each n ∈ ω. For example, the name for 2 ∈ ω in the language LΩ of arithmetic is the term “1 + 1”. The results stated will only apply to countable languages. This requirement is implicit in the hypothesis of the existence of an enumeration of all formulas with one free variable, for example. We also assume that formulas an...
متن کاملNotes on Undecidability and Incompleteness
Let Q be Robinson’s weak theory of arithmetic. We use recursiontheoretical methods to show that Q is essentially undecidable. Consequently, any recursively axiomatizable theory in which Q is interpretable is undecidable and incomplete. This is a strengthening of theorems of Gödel, Rosser and Tarski. We also present proofs of Gödel’s First and Second Incompleteness Theorems. In these proofs, the...
متن کاملIncompleteness and Undecidability of Predicate Logic
Theorem 1.1 Soundness If Γ ` φ, then Γ |= φ Completeness If Γ |= φ, then Γ ` φ We recall that ` refers to derivability e.g. in the natural deduction system of predicate logic as given in [1]. We also recall that |= refers to truth in all models: for all models (of the right signature) M, if all formulas of Γ are true in M, then φ is true in M. The completeness referred to above is also called s...
متن کاملIncompleteness, Undecidability and Automated Proofs - (Invited Talk)
Incompleteness and undecidability have been used for many years as arguments against automatising the practice of mathematics. The advent of powerful computers and proof-assistants – programs that assist the development of formal proofs by human-machine collaboration – has revived the interest in formal proofs and diminished considerably the value of these arguments. In this paper we discuss so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Theoretical Physics
سال: 1991
ISSN: 0020-7748,1572-9575
DOI: 10.1007/bf00671484